A Survey of Static Variable Ordering Heuristics for Efficient BDD/MDD Construction
نویسندگان
چکیده
The problem of finding an optimal variable ordering for Binary Decision Diagrams (BDD) or Multi-Valued Decision Diagrams (MDD) is widely known to be NP-Complete. This paper presents a survey of static heuristic techniques applied to ordering the variables of the BDD/MDD under construction in order to minimize the overall size of the resulting decision diagram.
منابع مشابه
Evaluation of Static Variable Ordering Heuristics for MDD Construction
After designing of Multi-Valued Logic Networks (MVLNs), the resulting circuits have to be veri ed to guarantee functional correctness. The most promising technique to cope with increasing device sizes are formal methods. Ordered Multi-Valued Decision Diagrams (OMDDs) have been proposed for formal veri cation of MVLNs. But OMDDs are very sensitive to the chosen variable ordering and several orde...
متن کاملMINCE: A Static Global Variable-Ordering for SAT Search and BDD Manipulation
The increasing popularity of SAT and BDD techniques in formal hardware verification and automated synthesis of logic circuits encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponential in the worst-case, the structure of real-world instances is a natural source of improvements. While SAT and BDD techniques are often presented as mutually exclusive alter...
متن کاملSelection of Efficient Re-Ordering Heuristics for MDD Construction
Multi-valued decision diagrams (MDDs) are a generalization of binary decision diagrams (BDDs). They are suitable for several applications in synthesis and verification of integrated circuits since often, functions with multi-valued input variables can be represented efficiently by MDDs. Their sizes counted in number of nodes vary from linear to exponential dependent on the variable ordering use...
متن کاملMINCE: A Static Global Variable-Ordering Heuristic for SAT Search and BDD Manipulation
The increasing popularity of SAT and BDD techniques in formal hardware verification and automated synthesis of logic circuits encourages the search for additional speedups. Since typical SAT and BDD algorithms are exponential in the worst-case, the structure of realworld instances is a natural source of improvements. While SAT and BDD techniques are often presented as mutually exclusive alterna...
متن کاملImplementation and Visualization of a BDD Package in JAVA
Decision Diagrams (DDs) are often used in VLSI CAD systems for efficient representation and manipulation of Boolean functions. The most popular data structure are reduced ordered Binary Decision Diagrams (BDDs) [Bry86,DB98], also called ROBDDs. They are part of almost all courses on function representation in VLSI CAD education. BDDs are very sensitive to the variable ordering, i.e. the size of...
متن کامل